Some Combinatorial Operators in Language Theory
نویسندگان
چکیده
Multitildes are regular operators that were introduced by Caron et al. in order to increase the number of Glushkov automata. In this paper, we study the family of the multitilde operators from an algebraic point of view using the notion of operad. This leads to a combinatorial description of already known results as well as new results on compositions, actions and enumerations.
منابع مشابه
Graph Algebras for Quantum Theory
We consider algebraic structure of Quantum Theory and provide its combinatorial representation. It is shown that by lifting to the richer algebra of graphs operator calculus gains simple interpretation as the shadow of natural operations on graphs. This provides insights into the algebraic structure of the theory and sheds light on the combinatorial nature and philosophy hidden behind its forma...
متن کاملOn Some Remarkable Operads Constructed from Baxter Operators 1
Language theory, symbolic dynamics, modelisation of viral insertion into the genetic code of a host cell motivate the introduction of new types of bialgebras, whose coalgebra parts are not necessarily coassociative. Similarly, certain algebraic descriptions of combinatorial objects such as weighted directed graphs through a coalgebraic formulation often require at least two coalgebras whose cop...
متن کاملDouble-null operators and the investigation of Birkhoff's theorem on discrete lp spaces
Doubly stochastic matrices play a fundamental role in the theory of majorization. Birkhoff's theorem explains the relation between $ntimes n$ doubly stochastic matrices and permutations. In this paper, we first introduce double-null operators and we will find some important properties of them. Then with the help of double-null operators, we investigate Birkhoff's theorem for descreate $l^p$ sp...
متن کاملOrdered Construction of Combinatorial Objects
The generating function method for counting species of combinatorial objects is applied to the construction of the objects in order. The species considered are those described using context-free grammars with additional group-invariant operators. Some species constructible with this method are integer partitions, rooted trees of specified or unbounded degree including binary and ordered trees, ...
متن کاملNormal Order: Combinatorial Graphs
Abstract. A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon which we touch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 18 شماره
صفحات -
تاریخ انتشار 2013